منابع مشابه
Mixed-Integer Convex Representability
We consider the question of which nonconvex sets can be represented exactly as the feasible sets of mixed-integer convex optimization problems. We state the first complete characterization for the case when the number of possible integer assignments is finite. We develop a characterization for the more general case of unbounded integer variables together with a simple necessary condition for re...
متن کاملRegularity in mixed-integer convex representability
Characterizations of the sets with mixed integer programming (MIP) formulations using only rational linear inequalities (rational MILP representable) and those with formulations that use arbitrary closed convex constraints (MICP representable) were given by Jeroslow and Lowe (1984), and Lubin, Zadik and Vielma (2017). The latter also showed that even MICP representable subsets of the natural nu...
متن کاملA Parametric Integer Programming Algorithm for Bilevel Mixed Integer Programs
We consider discrete bilevel optimization problems where the follower solves an integer program with a fixed number of variables. Using recent results in parametric integer programming, we present polynomial time algorithms for pure and mixed integer bilevel problems. For the mixed integer case where the leader’s variables are continuous, our algorithm also detects whether the infimum cost fail...
متن کاملMixed-Integer Linear Representability, Disjunctions, and Variable Elimination
Jeroslow and Lowe gave an exact geometric characterization of subsets of R that are projections of mixed-integer linear sets, a.k.a MILP-representable sets. We give an alternate algebraic characterization by showing that a set is MILP-representable if and only if the set can be described as the intersection of finitely many affine Chvátal inequalities. These inequalities are a modification of a...
متن کاملGlobal optimization of mixed-integer bilevel programming problems
Global optimization of mixed-integer nonlinear bilevel optimization problems is addressed using a novel technique. For problems where integer variables participate in both inner and outer problems, the outer level may involve general mixed-integer nonlinear functions. The inner level may involve functions that are mixed-integer nonlinear in outer variables, linear, polynomial, or multilinear in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2019
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-019-01424-w